Improved Immune Algorithm for Optimizing Distributed Production Scheduling Problem in Flexible Manufacturing System Subject to Machine Maintenance

نویسندگان

  • Mohd Nor Akmal Khalid
  • Umi Kalsom Yusof
چکیده

Competitiveness and rapid expansion of flexible manufacturing system (FMS), as one of the industrial alternatives, has attracted the attention of many practitioners and academicians. Globalization has further encouraged FMS development into distributed, self-reliant units of production center. Flexible manufacturing system in distributed system (FMSDS) considers multi-factory environments, where jobs are processed by a system of FMSs. Scheduling problems in FMSDS deal with allocation of jobs to factories, independent assignment of job operation to machines, and operations sequencing on a machine. In addition, many previous studies neglect the impact of maintenance as one of the core parts of production scheduling. Maintenance significantly affects the overall performance of production scheduling. As such, maintenance is considered in this paper as part of production scheduling. This paper aims to minimize the global makespan over all the factories. This paper proposes an improved immune algorithm (IIA) to solve scheduling problems in FMSDS subjects to machine maintenance. Antibody encoding is adopted to explicitly represents information about a factory, job, and maintenance, while a greedy decoding procedure exploits scheduling flexibility and determines the job routings. Instead of the traditional mutation operator, an improvised mutation operator is used to improve the solutions by refining the most promising individuals within passing generation (iteration). The proposed approach was compared with an ant colony algorithm and several variants of genetic algorithms. The proposed IIA improved the global makespan from 4% to 33% compared with other algorithms. IIA performance has also been tested with several adjustments of population sizes, clonal selection rates, and local explorative mutation rates. Keywords—distributed manufacturing, flexible manufacturing system, artificial immune system, preventive maintenance, optimization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Immune Algorithms for Solving Flexible Manufacturing System Distributed Production Scheduling Problem Subjects to Machine Maintenance

Competitiveness and rapid expansion of flexible manufacturing system (FMS) as one of the industrial alternatives has attracted many practitioners’ and academicians’ interest. Recent globalization events have further encouraged FMS development into distributed, self-reliant units of production center. The flexible manufacturing system in distributed system (FMSDS) considers multi-factory environ...

متن کامل

A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system

The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014